Proof nets and explicit substitutions
نویسندگان
چکیده
منابع مشابه
Proof Nets and Explicit Substitutions
We refine the simulation technique introduced in (Di Cosmo and Kesner 1997) to show strong normalization of λ-calculi with explicit substitutions via termination of cut elimination in proof nets (Girard 1987). We first propose a notion of equivalence relation for proof nets that extends the one in (Di Cosmo and Guerrini 1999), and we show that cut elimination modulo this equivalence relation is...
متن کاملStrong Normalization of Explicit Substitutions via Cut Elimination in Proof Nets
In this paper, we show the correspondence existing between normalization in calculi with explicit substitution and cut elimination in sequent calculus for Linear Logic,via Proof Nets. This correspondence allows us to prove that a typed version of the λx-calculus [34, 5] is strongly normalizing, as well as of all the calculi that can be translated to it keeping normalization properties such as λ...
متن کاملStrong Normalization of Explicit Substitutions via Cut Elimination in Proof Nets (Extended Abstract)
In this paper, we show the correspondence existing between normalization in calculi with explicit substitution and cut elimination in sequent calculus for Linear Logic, via Proof Nets. This correspondence allows us to prove that a typed version of the λx-calculus [30, 29] is strongly normalizing, as well as of all the calculi isomorphic to it such as λυ [24], λs [19], λd [21], and λf [11]. In o...
متن کاملProof-term synthesis on dependent-type systems via explicit substitutions
Typed A-terms are used as a compact and linear representation of proofs in intuitionistic logic. This is possible since the Curry-Howard isomorphism relates proof trees with typed A-terms. The proofs-as-terms principle can be used to check a proof by type checking the A-term extracted from the complete proof tree. However, proof trees and typed A-terms are built differently. Usually, an auxilia...
متن کاملProof Nets with Explicit Negation for Multiplicative Linear Logic
Multiplicative linear logic (MLL) was introduced in Gi87] as a one-sided sequent calculus: linear negation is a notion that is deened, via De Morgan identities. One obtains proof nets for MLL by identifying derivations in the one-sided calculus that are equal up to a permutation of inference rules. In this paper we consider a similar quotient for the formulation of MLL as a two-sided sequent ca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Structures in Computer Science
سال: 2003
ISSN: 0960-1295,1469-8072
DOI: 10.1017/s0960129502003791